TBox Abduction in ALC Using a DL Tableau
نویسندگان
چکیده
The formal definition of abduction asks what needs to be added to a knowledge base to enable an observation to be entailed. TBox abduction in description logics (DLs) asks what TBox axioms need to be added to a DL knowledge base to allow a TBox axiom to be entailed. We describe a sound and complete algorithm, based on the standard DL tableau, that takes a TBox abduction problem in ALC and generates solutions in a restricted language. We then show how this algorithm can be enhanced to deal with a broader range of problems in ALC.
منابع مشابه
A PSpace Tableau Algorithm for Acyclic Modalized ALC
We study ALCK_m, which extends the description logic ALC by adding modal operators of the basic multimodal logic K_m. We develop a sound and complete tableau algorithm Lambda_K for answering ALCK_m queries w.r.t. an ALCK_m knowledge base with an acyclic TBox. Defining tableau expansion rules in the presence of acyclic definitions by considering only the concept names on the left-hand side of TB...
متن کاملPreferential Role Restrictions
We extend ALC with preferential role restrictions as concept constructors, and argue that preferential universal restriction represents a defeasible version of standard universal restriction. The resulting DL is more expressive without adding to the complexity of TBox reasoning. We present a tableau system to compute TBox entailment, show that this notion of entailment is not sufficient when ad...
متن کاملReasoning with Semantic Tableau Binary Trees in Description Logic
Authors of the Handbook of Description Logic present tableaux algorithms by means of a collection of so-called completion rules intended to generate a completion of ABox with respect to a corresponding TBox of a knowledge base S. An approach we present here is slightly modified. We use a set S of DL formulas of a knowledge base Σ containing DL formulas of ABox and transcriptions of definitions ...
متن کاملPSpace Tableau Algorithms for Acyclic Modalized ALC
We study ALCKm and ALCS4m, which extend the description logic ALC by adding modal operators of the basic multi-modal logics Km and S4m. We develop a sound and complete tableau algorithm ΛK for answering ALCKm queries w.r.t. an ALCKm knowledge base with an acyclic TBox. Defining tableau expansion rules in the presence of acyclic definitions by considering only the concept names on the left-hand ...
متن کاملForgetting-Based Abduction in ALC
This paper presents a method for abduction in description logic ontologies. The method is based on forgetting and contrapositive reasoning and can produce semantically minimal hypotheses for TBox and ABox abduction in the description logic ALC. The method is not restricted to Horn clauses or atomic observations and hypotheses. Key considerations when using forgetting for abduction are addressed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014